#include<bits/stdc++.h>
#define ll long long
#define L x<<1
#define R L|1
#define mid (l+r>>1)
#define lc L,l,mid
#define rc R,mid+1,r
#define OK Ll<=l&&r<=Rr
#define Root 1,1,n
#define rep(x,y,z) for(int x=(y);x<=(z);x++)
#define per(x,y,z) for(int x=(y);x>=(z);x--)
#define repn(x) rep(x,1,n)
#define repm(x) rep(x,1,m)
#define pb push_back
#define e(x) for(int i=h[x],y=to[i];i;i=nxt[i],y=to[i])
#define E(x) for(auto y:p[x])
#define Pi pair<int,int>
#define ui unsigned ll
inline int read(){int s=0,w=1;char c=getchar();while(c<48||c>57) {if(c=='-') w=-1;c=getchar();}while(c>=48&&c<=57)s=(s<<1)+(s<<3)+c-48,c=getchar();return s*w;}
inline void pf(ll x){if(x<0) putchar('-'),x=-x;if(x>9)pf(x/10);putchar(x%10+48);}
using namespace std;
const int N =2e5+5,M=1e6+5,inf=(1LL<<31)-1,mod=998244353;
const ll llf=1e18;
inline void add(int &a,int b){((a+=b)>=mod) and (a-=mod);}
inline int Add(int a,int b){return add(a,b),a;}
inline int mul(int a,int b){return 1LL*a*b%mod;}
inline void Mul(int &a,int b){a=mul(a,b);}
inline void red(int &a,int b){add(a,mod-b);}
inline int Red(int a,int b){return red(a,b),a;}
inline int qp(int a,int b){if(!b)return 1;int c=qp(a,b>>1);Mul(c,c);if(b&1)Mul(c,a);return c;}
inline int INV(int x){return qp(x,mod-2);}
int n,m,q,h[N],to[M],nxt[M],cnt=1;
inline void add_(int a,int b){
	to[++cnt]=b,nxt[cnt]=h[a],h[a]=cnt;
}
struct edge{
	int x,y;
}e[N];
bool v[N],vis[N];
inline void dfs1(int x,int &s){
	s++,vis[x]=1;
	e(x)if(!vis[y])dfs1(y,s);
}
inline void subtask1(){
	rep(o,1,q){
		int k=read();
		rep(i,1,k)v[read()]=1;
		repm(i)if(!v[i])add_(e[i].x,e[i].y),add_(e[i].y,e[i].x);
		else v[i]=0;
		int s=0;
		dfs1(1,s),puts(s==n?"YES":"NO"),cnt=0;
		repn(i)h[i]=vis[i]=0;
	}
}
inline int dfs(int x,int fr){
	vis[x]=1;
	e(x)if(y==(fr^1))continue;
	else if(!vis[y]){
		int w=dfs(y,i);
		if(!w)continue;
		if(w==-1)return -1;
		v[x]=1;
		if(w==x)return -1;
		return w;
	}else return v[x]=1,y;
	return 0;
}
inline void subtask2(){
	dfs(1,0);
	rep(o,1,q){
		int k=read(),x;
		rep(i,1,k)x=read();
		if(k>1)puts("NO");
		else puts((v[e[x].x]&&v[e[x].y])?"YES":"NO");
	}
}
inline void Main(){
	n=read(),m=read();
	repm(i)e[i].x=read(),e[i].y=read();q=read();
	if(n<=3000&&m<=3000&&q<=3000)return subtask1(),void();
	if(n==m)return subtask2(),void();
}
signed main(){
	freopen("graph.in","r",stdin);
	freopen("graph.out","w",stdout); 
	int T=1;
	while(T--)Main(); 
	return 0;
}
